摘要 :
The preservation of both robust stability and weighted robust performance properties of controlled linear time-invariant single input single output (SISO) systems is studied, when performing substitutions (of the complex Laplace v...
展开
The preservation of both robust stability and weighted robust performance properties of controlled linear time-invariant single input single output (SISO) systems is studied, when performing substitutions (of the complex Laplace variable s) by a particular class of rational strictly positive real functions (SPR functions), the so-called strictly positive real functions of zero relative degree (SPR0 functions). Concerning weighted robust performance and model-matching, we provide some results on preservation of controller optimality. [References: 30]
收起
摘要 :
Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] introduce a top responsiveness condition on players' preferences in hedonic games and show that it guarantees the existence of a core stable partition. In t...
展开
Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] introduce a top responsiveness condition on players' preferences in hedonic games and show that it guarantees the existence of a core stable partition. In the present note we strengthen this observation by proving that under top responsiveness even the strict core is non-empty. (c) 2006 Elsevier B.V. All rights reserved.
收起
摘要 :
We study the computational complexity of the existence and the verification problem for wonderfully stable partitions (WSPE and WSPV) and of the existence problem for strictly core stable coalition structures (SCSCS) in enemy-orie...
展开
We study the computational complexity of the existence and the verification problem for wonderfully stable partitions (WSPE and WSPV) and of the existence problem for strictly core stable coalition structures (SCSCS) in enemy-oriented hedonic games. In this note, we show that WSPV is NP-complete and both WSPE and SCSCS are DP-hard, where DP is the second level of the boolean hierarchy, and we discuss an approach for classifying the latter two problems in terms of their complexity.
收起
摘要 :
In this paper, we will give a new comparison theorem that connects the solutions of perturbed and unperturbed dynamic systems in terms of two measures on time scales.
摘要 :
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under a less than strongly fair scheduler or for system topologies w...
展开
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time.
收起
摘要 :
We consider stabilization of an equilibrium point via infinite horizon discounted optimal control in discrete-time. In addition to applications in economics and social sciences, discounted optimal control is a commonly used numeri...
展开
We consider stabilization of an equilibrium point via infinite horizon discounted optimal control in discrete-time. In addition to applications in economics and social sciences, discounted optimal control is a commonly used numerical technique guaranteeing solvability of certain classes of optimal control problems. In this paper, we present conditions based on strict dissipativity that ensure that the optimally controlled system is asymptotically stable or practically asymptotically stable. These conditions are shown to be complementary to recently proposed conditions based on a detectability property. Illustrative examples are provided. (C) 2018 Elsevier Ltd. All rights reserved.
收起
摘要 :
Direct ESS has some disadvantages, which are seen even in the case of repeated games when the sequence of stage ESSs may not constitute the direct ESS in the repeated game. We present here the refinement of the ESS definition, whi...
展开
Direct ESS has some disadvantages, which are seen even in the case of repeated games when the sequence of stage ESSs may not constitute the direct ESS in the repeated game. We present here the refinement of the ESS definition, which eliminates these disadvantages and represents the base for the definition of ESS in games in extensive form. The effectiveness of this approach for multistage n-person games is shown for metagame (this notion is used for the first time), in which under some relevant conditions, the existence of ESS is proved, and ESSs are constructed using threat strategies.
收起
摘要 :
Recursive design and partial stabilization are considered where the method of recursive design is combined with the concept of partial stabilization. A generalized strict feedback form for partial stabilization is presented follow...
展开
Recursive design and partial stabilization are considered where the method of recursive design is combined with the concept of partial stabilization. A generalized strict feedback form for partial stabilization is presented followed by stabilization process.
收起
摘要 :
Recursive design and partial stabilization are considered where the method of recursive design is combined with the concept of partial stabilization. A generalized strict feedback form for partial stabilization is presented follow...
展开
Recursive design and partial stabilization are considered where the method of recursive design is combined with the concept of partial stabilization. A generalized strict feedback form for partial stabilization is presented followed by stabilization process.
收起
摘要 :
The main aim of this paper is to establish stability in set optimization in terms of convergence of a sequence of solution sets of perturbed set optimization problems to the solution set of the original set optimization problem bo...
展开
The main aim of this paper is to establish stability in set optimization in terms of convergence of a sequence of solution sets of perturbed set optimization problems to the solution set of the original set optimization problem both in the image space and the given space. The perturbed problems are obtained by perturbing the feasible set without changing the objective map. Formulations of external stability and internal stability are considered in the image space. External stability, which pertains to complete convergence of a subsequence of weak minimal solution sets, both in the sense of Hausdorff and convergence of sets, is established under certain compactness and continuity assumptions. This leads to the upper convergence of the sequence of solution sets in the given space. Internal stability is established for minimal solution sets under certain continuity, compactness and domination assumptions which leads to the lower convergence of the sequence of solution sets in the given space. External stability for minimal solution sets and internal stability for weak minimal solution sets are deduced under the strict quasiconvexity assumption. In particular, the results are also deduced for a vector optimization problem.
收起
原文获取